Перевод: со всех языков на русский

с русского на все языки

fixed-point radix

См. также в других словарях:

  • Fixed-point arithmetic — In computing, a fixed point number representation is a real data type for a number that has a fixed number of digits after (and sometimes also before) the radix point ( e.g. , after the decimal point . in English decimal notation). Fixed point… …   Wikipedia

  • fixed point — noun : any one of several definite temperatures determined by natural phenomena (as the freezing point of water) and used as reference points in the calibrating of thermometers * * * 1. n. Physics a well defined reproducible temperature that can… …   Useful english dictionary

  • fixed-point notation — noun a radix numeration system in which the location of the decimal point is fixed by convention • Syn: ↑fixed point representation system • Hypernyms: ↑mathematical notation …   Useful english dictionary

  • fixed-point representation system — noun a radix numeration system in which the location of the decimal point is fixed by convention • Syn: ↑fixed point notation • Hypernyms: ↑mathematical notation …   Useful english dictionary

  • fixed point — noun 1》 Physics a well defined reproducible temperature which can be used as a reference point, e.g. one defined by a change of phase. 2》 [as modifier] Computing denoting a mode of representing a number by a single sequence of digits whose values …   English new terms dictionary

  • Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… …   Wikipedia

  • Floating point — In computing, floating point describes a method of representing real numbers in a way that can support a wide range of values. Numbers are, in general, represented approximately to a fixed number of significant digits and scaled using an exponent …   Wikipedia

  • Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia

  • Arithmetic shift — In computer programming, an arithmetic shift is a shift operator, sometimes known as a signed shift (though it is not restricted to signed operands). For binary numbers it is a bitwise operation that shifts all of the bits of its operand; every… …   Wikipedia

  • Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …   Wikipedia

  • List of mathematics articles (R) — NOTOC R R. A. Fisher Lectureship Rabdology Rabin automaton Rabin signature algorithm Rabinovich Fabrikant equations Rabinowitsch trick Racah polynomials Racah W coefficient Racetrack (game) Racks and quandles Radar chart Rademacher complexity… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»